Subframization and Stabilization for Superintuitionistic Logics
نویسندگان
چکیده
With each superinuitionistic logic (si-logic), we associate its downward and upward subframizations, and characterize them by means of Zakharsyachev’s canonical formulas, as well as by embedding si-logics into the extensions of the propositional lax logic PLL. In an analogous fashion, with each si-logic, we associate its downward and upward stabilizations, and characterize them by means of stable canonical formulas, as well as by embedding si-logics into extensions of the intuitionistic S4.
منابع مشابه
An Algebraic Approach to Filtrations for Superintuitionistic Logics
There are two standard model-theoretic methods for proving the finite model property for modal and superintuionistic logics, the standard filtration and the selective filtration. While the corresponding algebraic descriptions are better understood in modal logic, it is our aim to give similar algebraic descriptions of filtrations for superintuitionistic logics via locally finite reducts of Heyt...
متن کاملA Note on Globally Admissible Inference Rules for Modal and Superintuitionistic Logics
In this shot note we consider globally admissible inference rules. A rule r is globally admissible in a logic L if r is admissible in all logics with the finite model property which extend L. Here we prove a reduction theorem: we show that, for any modal logic L extending K4, a rule r is globally admissible in L iff r is admissible in all tabular logics extending L. The similar result holds for...
متن کاملA Remark on a Peculiarity in the Functor Semantics for Superintuitionistic Predicate Logics with (or without) Equality
We notice the following slightly curious (and perhaps, slightly unexpected) logical property of the functor semantics for superintuitionistic predicate logics, contrasting with a well-known property of the usual Kripke semantics. Namely, for a category C its logic (i.e., the logic of all C-sets with the given, fixed C) in general is not reducible to cones (i.e., restrictions of C to upward clos...
متن کاملCofinal Stable Logics
We generalize the (∧,∨)-canonical formulas of [3] to (∧,∨)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by (∧,∨)-canonical rules. This provides an intuitionistic analogue of [6], and is an alternative of [19]. It also yields a convenient characterization of stable superintuitionistic logics introduced in [3]. The (∧,∨)-canonical form...
متن کاملModal $\mathrm{I}\mathrm{n}\mathrm{t}\mathrm{u}\mathrm{i}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}\tilde{\mathrm{l}}\mathrm{s}\mathrm{t}\mathrm{i}\mathrm{C}$ Logics and Predicate Superintuitionistic Logics: $\mathrm{C}_{0\Gamma \mathrm{r}\mathrm{e}..\mathrm{S}},\mathrm{p}$
In this note we deal with intuitionistic modal logics over $\mathcal{M}\mathcal{I}PC$ and predicate superintuitionistic logics. We study the correspondence between the lattice of all (normal) extensions of MTPC and the lattice of all predicate superintuitionistic logics. Let $\mathrm{L}_{Prop}$ denote a propositional language which contains two modal operators $\square$ and $\mathrm{O}$ , and $...
متن کامل